Consistency problem for one - variable patterns is
نویسنده
چکیده
The present paper deals with the decision problem for the class of one-variable patterns, called the consistency problem. Although this problem is obviously in NP, its tractability is unknown. We prove the consistency problem to be decidable in P.
منابع مشابه
Variable Elimination in Binary CSP via Forbidden Patterns
A variable elimination rule allows the polynomialtime identification of certain variables whose elimination does not affect the satisfiability of an instance. Variable elimination in the constraint satisfaction problem (CSP) can be used in preprocessing or during search to reduce search space size. We show that there are essentially just four variable elimination rules defined by forbidding gen...
متن کاملFinding a One-Variable Pattern from Incomplete Data
The present paper deals with the problem of nding a consistent one-variable pattern from incomplete positive and negative examples. The studied problems are called an extension, a consistent extension and a robust extension, denoted by e, ce and re, respectively. The e corresponds an ordinary decision problem of nding a consistent one-variable patterns for given positive and negative examples. ...
متن کاملArc Consistency in Binary Encodings of Non-binary CSPs: Theoretical and Experimental Evaluation
A Non-binary Constraint Satisfaction Problem (CSP) can be solved by converting the problem into an equivalent binary one and applying well-established binary CSP techniques. An alternative way is to use extended versions of binary techniques directly on the non-binary problem. There are two well-known computational methods in the literature for translating a non-binary CSP to an equivalent bina...
متن کاملConstraint Satisfaction Problem with Bilevel Constraint: Application to Interpretation of Over-Segmented Images
In classical finite-domain constraint satisfaction problems, the assumption made is that only one value is associated with only one variable. For example, in pattern recognition one variable is associated with only one segmented region. However, in practice, regions are often oversegmented which results in failure of any one to one mapping. This paper proposes a definition of finite-domain cons...
متن کاملA new ltering algorithm for the graph isomorphism problem
The graph isomorphism problem consists in deciding if two given graphs have an identical structure. This problem may be modeled as a constraint satisfaction problem in a very straightforward way, so that one can use constraint programming to solve it. However, constraint programming is a generic tool that may be less e cient than dedicated algorithms which take advantage of the global semantic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007